Linear Time Recognition of P4-Indifferent Graphs
نویسنده
چکیده
A simple graph is P4-indifferent if it admits a total order < on its nodes such that every chordless path with nodes a, b, c, d and edges ab, bc, cd has a < b < c < d or a > b > c > d. P4-indifferent graphs generalize indifferent graphs and are perfectly orderable. Recently, Hoàng, Maffray and Noy gave a characterization of P4-indifferent graphs in terms of forbidden induced subgraphs. We clarify their proof and describe a linear time algorithm to recognize P4-indifferent graphs. When the input is a P4-indifferent graph, then the algorithm computes an order < as above.
منابع مشابه
Split-Perfect Graphs: Characterizations and Algorithmic Use
Two graphs G and H with the same vertex set V are P4-isomorphic if every four vertices {a, b, c, d} ⊆ V induce a chordless path (denoted by P4) in G if and only if they induce a P4 in H. We call a graph split-perfect if it is P4-isomorphic to a split graph (i.e., a graph being partitionable into a clique and a stable set). This paper characterizes the new class of split-perfect graphs using the...
متن کاملLinear time recognition of P4-indifference graphs
A P4 is a chordless path of four vertices. A graph is P4-indifference if it admits an ordering < on its vertex set such that every P4 abcd has a < b < c < d or d < c < b < a. Such an ordering is called a P4-indifference ordering. The P4-indifference graphs were introduced in [Chv84] as a particular class of perfectly orderable graphs. A graph is perfectly orderable if there exists an ordering o...
متن کاملOn Some Cograph Extensions and Their Algorithms
This paper reviews some classes of graphs related to cographs. The characterization of cographs by which there is no induced path on three edges (P4) is relaxed in various ways. Considered are classes of graphs that are uniquely representable by trees. Three such classes studied here are: P4-reducible, P4-sparse and P4-extendible graphs. In addition, we show that the class of P4-lite graphs has...
متن کاملRecognition and Orientation Algorithms for P4-Comparability Graphs
We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P4-comparability graph and the problem of producing an acyclic P4-transitive orientation of a P4-comparability graph. These problems have been considered by Hoàng and Reed who described O(n) and O(n)-time algorithms for their solution respectively, where n is...
متن کاملA Simple Linear Time LexBFS Cograph Recognition Algorithm
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for various families of graphs. In this paper, we add to this work by producing a simple two LexBFS sweep algorithm to recognize the family of cographs. This algorithm extends to other related graph families such as P4-red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999